Goal-Directed Completion Using SOUR Graphs
نویسنده
چکیده
We give the rst Goal-Directed version of the Knuth Bendix Completion Procedure. Our procedure is based on Basic Completion and SOUR Graphs. There are two phases to the procedure. The rst phase, which runs in polynomial time, compiles the equations and the goal into a constrained tree automata representing the completed system, and a set of constraints representing goal solutions. The second phase starts with the goal solutions and works its way back to the original equations, solving constraints along the way.
منابع مشابه
SOUR Graphs for E cient Completion
We introduce a data structure called SOUR Graphs and present an eecient Knuth-Bendix completion procedure based on it. SOUR Graphs allow for a maximal structure sharing of terms in rewriting systems. The term representation is a dag representation, except that edges are labelled with equational constraints and variable renamings. The rewrite rules correspond to rewrite edges, the uniication pro...
متن کاملSOUR graphs for efficient completion
We introduce a data structure called SOUR graphs and present an efficient Knuth-Bendix completion procedure based on it. SOUR graphs allow for a maximal structure sharing of terms in rewriting systems. The term representation is a dag representation, except that edges are labelled with equational constraints and variable renamings. The rewrite rules correspond to rewrite edges, the unification ...
متن کاملHamiltonian completions of sparse random graphs
Given a (directed or undirected) graph G, finding the smallest number of additional edges which make the graph Hamiltonian is called the Hamiltonian Completion Problem (HCP). We consider this problem in the context of sparse random graphs G(n, c/n) on n nodes, where each edge is selected independently with probability c/n. We give a complete asymptotic answer to this problem when c < 1, by cons...
متن کاملCompleting orientations of partially oriented graphs
We initiate a general study of what we call orientation completion problems. For a fixed class C of oriented graphs, the orientation completion problem asks whether a given partially oriented graph P can be completed to an oriented graph in C by orienting the (non-oriented) edges in P . Orientation completion problems commonly generalize several existing problems including recognition of certai...
متن کاملA characterization of partial directed line graphs
Can a directed graph be completed to a directed line graph? If possible, how many arcs must be added? In this paper we address the above questions characterizing partial directed line (PDL) graphs, i.e., partial subgraph of directed line graphs.We show that for such class of graphs a forbidden configuration criterion and a Krausz’s like theorem are equivalent characterizations. Furthermore, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997